Hybrid In-Memory and On-Disk Tables for Speeding-Up Table Accesses

نویسندگان

  • Joan Guisado-Gámez
  • Antoni Wolski
  • Calisto Zuzarte
  • Josep-Lluís Larriba-Pey
  • Victor Muntés-Mulero
چکیده

Main memory database management systems have become essential for response-time-bounded applications, such as those in telecommunications systems or Internet, where users frequently access a table in order to get information or check whether an element exists, and require the response to be as fast as possible. Continuous data growth is making it unaffordable to keep entire relations in memory and some commercial applications provide two different engines to handle data inmemory and on-disk separately. However, these systems assign each table to one of these engines, forcing large relations to be kept on secondary storage. In this paper we present TwinS — a hybrid database management system that allows managing hybrid tables, i.e. tables partially managed by both engines. We show that we can reduce response time when accessing a large table in the database. All our experiments have been run on a dual-engine DBMS: IBM ©SolidDBR ©.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cuckoo++ Hash Tables: High-Performance Hash Tables for Networking Applications

Hash tables are an essential data-structure for numerous networking applications (e.g., connection tracking, rewalls, network address translators). Among these, cuckoo hash tables provide excellent performance by allowing lookups to be processed with very few memory accesses (2 to 3 per lookup). Yet, for large tables, cuckoo hash tables remain memory bound and each memory access impacts perform...

متن کامل

Adaptive NUMA-aware data placement and task scheduling for analytical workloads in main-memory column-stores

Non-uniform memory access (NUMA) architectures pose numerous performance challenges for main-memory column-stores in scaling up analytics on modern multi-socket multi-core servers. A NUMAaware execution engine needs a strategy for data placement and task scheduling that prefers fast local memory accesses over remote memory accesses, and avoids an imbalance of resource utilization, both CPU and ...

متن کامل

Helix: IP lookup scheme based on helicoidal properties of binary trees

In this paper, we propose an IP lookup scheme, called Helix, that performs parallel prefix matching at the different prefix lengths and uses the helicoidal properties of binary trees to reduce tree height. The reduction of the tree height is achieved without performing any prefix modification. Helix minimizes the amount of memory used to store long and numerous prefixes and achieves IP lookup a...

متن کامل

A Genetic-Algorithm Solution for Designing Optimal Forwarding Tables

A high speed IP address lookup engine with a reasonable memory cost is a key factor for designing a router at wire speed. This paper proposes a hardware solution that performs each IP address lookup in a few number of memory accesses with minimum amount of memory requirement. Our solution is based on dividing destination IP address into several segments. For finding the optimum address segmenta...

متن کامل

SHIP: A Scalable High-performance IPv6 Lookup Algorithm that Exploits Prefix Characteristics

Due to the emergence of new network applications, current IP lookup engines must support high-bandwidth, low lookup latency and the ongoing growth of IPv6 networks. However, existing solutions are not designed to address jointly those three requirements. This paper introduces SHIP, an IPv6 lookup algorithm that exploits prefix characteristics to build a two-level data structure designed to meet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010